A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem

Abstract The Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it a natural extension of the Problem. In ADVRP problem, each customer visited exactly once by vehicle; every tour starts and ends at depot; traveled distance vehicle not allowed to exceed predetermined limit. We propose hybrid metaheuristic algorithm combining Randomized Variable Neighborhood Search (RVNS) Tabu (TS) solve problem. combination multiple neighborhoods tabu mechanism used for their capacity escape local optima while exploring solution space. Furthermore, intensification diversification phases are also included deliver optimized diversified solutions. Extensive numerical experiments comparisons with all state-of-the-art algorithms show that proposed method highly competitive in terms quality computation time, providing new best solutions number instances.